Persistency and Nonviolence Decision Problems in P/T-Nets with Step Semantics
نویسنده
چکیده
Persistency is one of the notions widely investigated due to its application in concurrent systems. The classical notion refers to nets with a standard sequential semantics. We will present two approaches to the issue (nonviolence and persistency). The classes of different types of nonviolence and persistency will be defined for nets with step semantics. We will prove that decision problem concerning all the defined types are decidable.
منابع مشابه
On Persistent Reachability in Petri Nets
The notion of persistency, based on the rule “no action can disable another one” is one of the classical notions in concurrency theory. In this paper, we deal with arbitrary place/transition nets, but concentrate on their persistent computations. It leads to an interesting decision problem: Is a given marking reachable with a persistent run? In order to study the persistent-reachability problem...
متن کاملA Causal Semantics for Contextual P/T Nets
The problem of nding a true concurrent semantics for contextual P/T nets has not been deeply studied yet. The interest for such a semantics has been renewed by some recent proposals to equip mobile process algebras with a net semantics based on this model. In this paper we move a step towards the deenition of such a semantics: we rst propose a causal semantics for P/T nets and we prove that thi...
متن کاملA Taxonomy of Persistent and Nonviolent Steps
A concurrent system is persistent if throughout its operation no activity which become enabled can subsequently be prevented from being executed by any other activity. This is often a highly desirable (or even absolutely necessary) property, in particular, if the system is to be implemented in hardware. Over the past 40 years, persistence has been investigated and applied in practical implement...
متن کاملHierarchy of persistency with respect to the length of actions disability
The notion of persistency, based on the rule "no action can disable another one" is one of the classical notions in concurrency theory. We recall two ways of generalization of this notion: the first is "no action can kill another one" and the second "no action can kill another enabled one". Afterwards we present an infinite hierarchy of computations in which one action disables another one for ...
متن کاملLevels of Persistency in Place/Transition Nets
The classical notion of persistency, originated in 60s, has been extensively studied up to now. An action of a processing system is said to be persistent if, whenever it becomes enabled, it remains enabled until executed. And a system is said to be persistent if each of its actions is persistent. This notion, introduced by Karp/Miller, is one of the most frequently discussed issues in the Petri...
متن کامل